Pricing and distributed QoS control for elastic network traffic

We study a processor-sharing model in which users choose between a high- and a low-priority service, based on their utility functions and prices charged by the service provider. The latter aims at revenue maximization. The model is motivated by file transmissions in data networks with distributed congestion control.     

Characterization of heat-assisted magnetic probe recording on CoNi/Pt multilayers

A method of heat-assisted magnetic recording (HAMR) potentially suitable for probe-based storage systems is characterized. In this work, field emission current from a scanning tunneling microscope (STM) tip is used as the heating source. Pulse voltages of 2–7 V were applied to a CoNi/Pt multilayered film fabricated on either bare silicon or oxidized silicon substrates. Different types of Ir/Pt and W STM tips were used in the experiment. The results show that thermally recorded magnetic marks are formed with a nearly uniform mark size of 170 nm on the film fabricated on bare silicon substrate when the pulse voltage is above a threshold voltage. The mark size becomes 260 nm when they are written on the identical film fabricated on an oxidized silicon substrate. The threshold voltage depends on the material work function of the tip, with W having a threshold voltage about 1 V lower than Pt. A synthesized model, which contains the calculation of the emission current, the simulation of heat transfer during heating, and the study of magnetic domain formation, was introduced to explain experimental results. The simulation agrees well with the experiments.     

New trends in localization theory

In this article we discuss some recent trends in the research of electron and phonon localization, specially in the field of quasiperiodic potentials. Then, a new scheme to detect and classify localization is developed by studying the band scaling of a related supercrystal made from replicas of the system. For one dimension, this leads to the use of dynamical systems theory to obtain the localization length and the scaling exponents of the wave functions.     

Using constraint preconditioners with regularized saddle-point problems

The problem of finding good preconditioners for the numerical solution of a certain important class of indefinite linear systems is considered. These systems are of a 2 by 2 block (KKT) structure in which the (2,2) block (denoted by -C) is assumed to be nonzero. In Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl. 21 (2000), Keller, Gould and Wathen introduced the idea of using constraint preconditioners that have a specific 2 by 2 block structure for the case of C being zero. We shall give results concerning the spectrum and form of the eigenvectors when a preconditioner of the form considered by Keller, Gould and Wathen is used but the system we wish to solve may have C ≠0. In particular, the results presented here indicate clustering of eigenvalues and, hence, faster convergence of Krylov subspace iterative methods when the entries of C are small; such a situations arise naturally in interior point methods for optimization and we present results for such problems which validate our conclusions.     

A tight upper bound for the number of intersections between two rectangular paths

The problem of finding the number of intersections between two geometric figures in the plane has been studied extensively in literature. In this paper, the geometric figure comprising a continuous rectilinear path (called rectangular path) is considered, and a tight (least) upper bound onI(P, Q), the number of intersections between two rectangular pathsP andQ, is given.Editors' Note: One of our referees has reported that the main result of this paper has recently been given independently by a Chinese researcher at the University of Science and Technology, Hefei, P. R. of China. His paper is under publication in the Chinese Science Bulletin. However, since this journal may not be easily accessible to our readers, and further the two papers are obviously independent of each other, theBIT Editors have decided to accept the present paper.     

Minimum Fill-in on Circle and Circular-Arc Graphs

We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in timeO(n³).     

The evidential reasoning approach for MADA under both probabilistic and fuzzy uncertainties

Many multiple attribute decision analysis (MADA) problems are characterised by both quantitative and qualitative attributes with various types of uncertainties. Incompleteness (or ignorance) and vagueness (or fuzziness) are among the most common uncertainties in decision analysis. The evidential reasoning (ER) approach has been developed in the 1990s and in the recent years to support the solution of MADA problems with ignorance, a kind of probabilistic uncertainty. In this paper, the ER approach is further developed to deal with MADA problems with both probabilistic and fuzzy uncertainties.In this newly developed ER approach, precise data, ignorance and fuzziness are all modelled under the unified framework of a distributed fuzzy belief structure, leading to a fuzzy belief decision matrix. A utility-based grade match method is proposed to transform both numerical data and qualitative (fuzzy) assessment information of various formats into the fuzzy belief structure. A new fuzzy ER algorithm is developed to aggregate multiple attributes using the information contained in the fuzzy belief matrix, resulting in an aggregated fuzzy distributed assessment for each alternative. Different from the existing ER algorithm that is of a recursive nature, the new fuzzy ER algorithm provides an analytical means for combining all attributes without iteration, thus providing scope and flexibility for sensitivity analysis and optimisation. A numerical example is provided to illustrate the detailed implementation process of the new ER approach and its validity and wide applicability.     

Perfect information two-person zero-sum markov games with imprecise transition probabilities

Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model.     

Density viscous continuum traffic flow model

A new traffic flow model called density viscous continuum model is developed to describe traffic more reasonably. The two delay time scales are taken into consideration, differing from the model proposed by Xue and Dai [Phys. Rev. E 68 (2003) 066123]. Moreover the relative density is added to the motion equation from which the viscous term can be derived, so we obtain the macroscopic continuum model from microscopic car following model successfully. The condition for stable traffic flow is derived. Nonlinear analysis shows that the density fluctuation in traffic flow induces density waves. Near the onset of instability, a small disturbance could lead to solitons determined by the Korteweg-de-Vries (KdV) equation, and the soliton solution is derived. The results show that local cluster effects can be obtained from the new model and are consistent with the diverse nonlinear dynamical phenomena observed in the freeway traffic.     

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value. We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost stochastic dynamic programming problems and show that HBPI also converges to the optimal value.